Algorithm for backrub motions in protein design
نویسندگان
چکیده
منابع مشابه
Algorithm for backrub motions in protein design
MOTIVATION The Backrub is a small but kinematically efficient side-chain-coupled local backbone motion frequently observed in atomic-resolution crystal structures of proteins. A backrub shifts the C(alpha)-C(beta) orientation of a given side-chain by rigid-body dipeptide rotation plus smaller individual rotations of the two peptides, with virtually no change in the rest of the protein. Backrubs...
متن کاملThe Role of Local Backrub Motions in Evolved and Designed Mutations
Amino acid substitutions in protein structures often require subtle backbone adjustments that are difficult to model in atomic detail. An improved ability to predict realistic backbone changes in response to engineered mutations would be of great utility for the blossoming field of rational protein design. One model that has recently grown in acceptance is the backrub motion, a low-energy dipep...
متن کاملinvestigating the integration of translation technologies into translation programs in iranian universities: basis for a syllabus design in translation technology
today, information technology and computers are indispensable tools of any profession and translation technologies have become an indispensable part of translator’s workstation. with the increasing demands for high productivity and speed as well as consistency and with the rise of new demands for translation and localization, it is necessary for translators to be familiar with market demands an...
A New Algorithm for Protein Design
We apply a new approach to the reverse protein folding problem. Our method uses a minimization function in the design process which is different from the energy function used for folding. For a lattice model, we show that this new approach produces sequences that are likely to fold into desired structures. Our method is a significant improvement over previous attempts which used the energy func...
متن کاملA Planning Algorithm for Dynamic Motions
Motions such as ips and jumps are challenging to animate and to perform in real life. The diiculty arises from the dynamic nature of the movements and the precise timing required for their successful execution. This paper presents a decision-tree search algorithm for planning the control for these types of motion. Several types of results are presented, including cartwheels, ips and hops for a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2008
ISSN: 1367-4803,1460-2059
DOI: 10.1093/bioinformatics/btn169